Convergence Rates for Runlength Constrained Capacities
نویسندگان
چکیده
Convergence results are given for the number of binary arrays with at least d and at most k zeros between ones, along any coordinate axis, asymptotically for fixed d as k !1. C. Pomerance is with Bell Laboratories, Lucent Technologies, 600 Mountain Ave., Murray Hill, NJ 07974-0636 ([email protected]). K. Zeger is with the Department of Electrical and Computer Engineering, University of California, San Diego, CA 92093-0407 ([email protected]). The research was supported in part by the National Science Foundation.
منابع مشابه
Variable-length state splitting with applications to average runlength-constrained (ARC) codes
A new class of constrained systems: average runlength constraints (ARC) are defined. These systems are defined by requiring that the sum of n consecutive runlengths be bounded above by a linear function of IZ. In particular, the running average runlength of every sequence in the system is bounded above by a constant. A general result is given on the capacity of ARC systems. The state splitting ...
متن کاملCascading methods for runlength-limited arrays
Runlength-limited sequences and arrays have found applications in magnetic and optical recording. While the constrained sequences are well studied, little is known about constrained arrays. In this correspondence we consider the question of how to cascade two arrays with the same runlength constraints horizontally and vertically, in such a way that the runlength constraints will not be violated...
متن کاملMarkers to construct DC free (d, k) constrained balanced block codes using Knuth’s inversion
We adapt Knuth’s balancing scheme, which was originally developed for unconstrained binary code words. We present a simple method to balance the NRZ runlength constrained block codes corresponding to (d, k) constrained NRZI sequences. A short marker violating the maximum runlength or k constraint is used to indicate the balancing point for Knuth’s inversion. The marker requires fewer overhead b...
متن کاملMaximum runlength-limited codes with error control capabilities
New methods are presented to protect maximum runlength-limited sequences against random and burst errors and to avoid error propagation. The methods employ parallel conversion techniques and enumerative coding algorithms that transform binary user information into constrained codewords. The new schemes have a low complexity and are very efficient. The approach can be used for modulation coding ...
متن کاملAn enumerative method for runlength-limited codes: permutation codes
Permutation codes, introduced by Slepian, were shown to perform well on an additive white Gaussian noise (AWGN) channel. Unfortunately, these codes required large lookup tables, making them quite complex to implement even though the maximum-likelihood decoder is very simple. In this correspondence, we present an enumeration scheme which encodes and decodes permutation codes with low complexity....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001